A Logarithmic Additive Integrality Gap for Bin Packing Rebecca Hoberg and

Source URL: www.math.washington.edu

• Packing problems
• Bin packing problem
• Bin

BinPackingViaDiscrepancyOfPermutations-talg.dvi

Source URL: www.math.washington.edu

• Operations research
• Matrix theory
• Permutation
• Matrix
• Bin packing problem
• Linear programming
• FO

A semidefinite programming hierarchy for packing problems in discrete geometry David de Laat (TU Delft) Joint work with Frank Vallentin (Universit¨at zu K¨oln) Applications of Real Algebraic Geometry

Source URL: www.daviddelaat.nl

• NP-complete problems
• Operations research
• Independent set
• Optimization problem
• Discrete geometry
• Graph
• Duality
• Packing problems
• Mathematical optimization
• Planar graphs
• Matching
• Matroid

65 Documenta Math. Column Generation for Linear and Integer Programming George L. Nemhauser

Source URL: www.math.uiuc.edu

• Operations research
• Combinatorial optimization
• Mathematical optimization
• Packing problems
• Linear programming
• Column generation
• Cutting stock problem
• Integer programming
• Linear programming relaxation
• Simplex algorithm
• DantzigWolfe decomposition
• Branch and bound

Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English)

Source URL: bioinfo.ict.ac.cn

• Operations research
• Dynamic programming
• Combinatorial optimization
• Packing problems
• Cryptography
• Knapsack problem
• Subset sum problem
• Approximation algorithm
• Algorithm
• Greedy algorithm
• Heuristic
• Branch and bound

Abstracts Abstracts are listed in the order of presentation. Monday, 18 April Bin Packing: From Theory to Experiment and Back Again David S. Johnson

Source URL: events.cs.bham.ac.uk

• Logic in computer science
• Formal methods
• Philosophical logic
• Metalogic
• Formal verification
• Theoretical computer science
• First-order logic
• Modal logic
• Logic
• Mathematical logic
• P versus NP problem
• Automated theorem proving

An ant colony optimization inspired algorithm for the Set Packing Problem with application to railway infrastructure Xavier GANDIBLEUX1 , Julien JORGE1 , S´ ebastien ANGIBAUD1 Xavier DELORME2 and Joaquin RODRIGUEZ3

Source URL: www.emse.fr

• Institut national de recherche sur les transports et leur scurit
• Universit Lille Nord de France
• Ant colony optimization algorithms

ON COVERING EXPANDER GRAPHS BY HAMILTON CYCLES ´ ROMAN GLEBOV, MICHAEL KRIVELEVICH, AND TIBOR SZABO Abstract. The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In thi

Source URL: page.mi.fu-berlin.de

SPHERE PACKING BOUNDS VIA SPHERICAL CODES HENRY COHN AND YUFEI ZHAO Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls in Euclidean space. The current best upper bound in a

Source URL: yufeizhao.com

Ingeniería Investigación y Tecnología, volumen XVII (número 2), abril-junio 2016: ISSNFI-UNAM (artículo arbitrado) Un algoritmo para el Strip Packing Problem obtenido mediante la extracción de ha

Source URL: www.ingenieria.unam.mx